An NEH-based heuristic algorithm for distributed permutation flowshop scheduling problems

نویسندگان

  • Jian Gao
  • Rong Chen
چکیده

Distributed Permutation Flowshop Scheduling Problem (DPFSP) is a newly proposed scheduling problem with a strong engineering background. Whereas there is a body of work on scheduling problems in the past decades, the literature on DPFSPs is scant and in its infancy. Motivated by the good performances of some heuristics in a very recent work, we propose a constructive heuristic algorithm enhanced through a novel dispatching rule to deal with the DPFSP. Given multiple factories in a DPFSP, our dispatching rule will insert a group of jobs to the factories at one time instead of inserting one job at one time like the original rules. The time complexity of the proposed heuristic algorithm is the same as that of the NEH with the original rule. To validate the proposed heuristic, intensive benchmark experiments are carried out on the large problem instances, and the results show that the proposed algorithm outperforms the existing heuristics in terms of tradeoff between solution quality and running time.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Constructive Genetic Algorithm for permutation flowshop scheduling

The general flowshop scheduling problem is a production problem where a set of n jobs have to be processed with identical flow pattern on m machines. In permutation flowshops the sequence of jobs is the same on all machines. A significant research effort has been devoted for sequencing jobs in a flowshop minimizing the makespan. This paper describes the application of a Constructive Genetic Alg...

متن کامل

An improved heuristic for permutation flowshop scheduling

Flowshop scheduling deals with determination of optimum sequence of jobs to be processed on some machines in a fixed order so as to satisfy certain scheduling criteria. The general problem of scheduling has been shown to be NP-complete. Exact algorithms, such as integer programming and branch-and-bound, guarantee optimality but do not yield the optimum solution in polynomial time even for probl...

متن کامل

A New Improved NEH Heuristic for Permutation Flowshop Scheduling Problems

Job evaluation and differentiation are crucial in scheduling. Since jobs can be represented by vectors of processing times, the average, standard deviation, and skewness of job processing times can be defined as the moments of their probability distribution. The first and the second moments of processing times are effective in sorting jobs (Dong et al., 2008), however they are not yet optimized...

متن کامل

Solving Re-entrant No-wait Flexible Flowshop Scheduling Problem; Using the Bottleneck-based Heuristic and Genetic Algorithm

In this paper, we study the re-entrant no-wait flexible flowshop scheduling problem with makespan minimization objective and then consider two parallel machines for each stage. The main characteristic of a re-entrant environment is that at least one job is likely to visit certain stages more than once during the process. The no-wait property describes a situation in which every job has its own ...

متن کامل

An iterated greedy algorithm for the flowshop scheduling problem with blocking

This paper proposes an iterated greedy algorithm for solving the blocking flowshop scheduling problem for makespan minimization. Moreover, it presents an improved NEH-based heuristic, which is used as the initial solution procedure for the iterated greedy algorithm. The effectiveness of both procedures was tested on some of Taillard’s benchmark instances that are considered to be blocking flows...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012